On social-temporal group query with acquaintance constraint
نویسندگان
چکیده
منابع مشابه
On Social-Temporal Group Query with Acquaintance Constraint
Three essential criteria are important for activity planning, including: (1) finding a group of attendees familiar with the initiator, (2) ensuring each attendee in the group to have tight social relations with most of the members in the group, and (3) selecting an activity period available for all attendees. Therefore, this paper proposes Social-Temporal Group Query to find the activity time a...
متن کاملThe Complexity of Query Evaluation in Indefinite Temporal Constraint Databases
In previous work we have developed the scheme of indeenite L-constraint databases where L, the parameter, is a rst-order constraint language. This scheme extends the constraint database proposal of Kanellakis, Kuper and Revesz to include in-deenite (or uncertain) information in the style of Imielinski and Lipski. In this paper we study the complexity of query evaluation in an important instance...
متن کاملConstraint Database Query Evaluation with Approximation
We consider the problem of solving a large number of simple systems of linear constraints. This problem occurs in the context of constraint databases storing a very large collections of data while the constraints are over a small number of variables. The developed methodology is based on a hierarchical evaluation of the constraints which are rst simpliied, and replaced by constraints approximat...
متن کاملTemporal Constraint Reasoning With Preferences
A number of reasoning problems involving the manipulation of temporal information can be viewed as implicitly inducing an ordering of decisions involving time (associated with durations or orderings of events) on the basis of preferences. For example, a pair of events might be constrained to occur in a certain order, and, in addition, it might be preferable that the delay between them be as lar...
متن کامل{41 () Constraint Query Algebras
Constraint query languages are natural extensions of relational database query languages. A framework for their declarative speciication (constraint calculi) and eecient implementation (low data complexity and secondary storage indexing) was presented in Kanellakis et al., 1995. Constraint query algebras form a procedural language layer between high-level declarative calculi and low-level index...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the VLDB Endowment
سال: 2011
ISSN: 2150-8097
DOI: 10.14778/1978665.1978671